spMC: Modelling Spatial Random Fields with Continuous Lag Markov Chains
نویسندگان
چکیده
منابع مشابه
spMC: Modelling Spatial Random Fields with Continuous Lag Markov Chains
Abstract Currently, a part of the R statistical software is developed in order to deal with spatial models. More specifically, some available packages allow the user to analyse categorical spatial random patterns. However, only the spMC package considers a viewpoint based on transition probabilities between locations. Through the use of this package it is possible to analyse the spatial variabi...
متن کاملSPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation
Dealing with sparse, long-tailed datasets, and coldstart problems is always a challenge for recommender systems. These issues can partly be dealt with by making predictions not in isolation, but by leveraging information from related events; such information could include signals from social relationships or from the sequence of recent activities. Both types of additional information can be use...
متن کاملGauss-Markov random fields (CMrf) with continuous indices
Gauss–Markov random fields (GMrf’s) play an important role in the modeling of physical phenomena. The paper addresses the second-order characterization and the sample path description of GMrf’s when the indexing parameters take values in bounded subsets of <; d 1. Using results of Pitt, we give conditions for the covariance of a GMrf to be the Green’s function of a partial differential operator...
متن کاملEfficient Inference of Continuous Markov Random Fields with Polynomial Potentials
In this paper, we prove that every multivariate polynomial with even degree can be decomposed into a sum of convex and concave polynomials. Motivated by this property, we exploit the concave-convex procedure to perform inference on continuous Markov random fields with polynomial potentials. In particular, we show that the concave-convex decomposition of polynomials can be expressed as a sum-of-...
متن کاملTexture modelling with nested high-order Markov-Gibbs random fields
Currently, Markov–Gibbs random field (MGRF) image models which include high-order interactions are almost always built by modelling responses of a stack of local linear filters. Actual interaction structure is specified implicitly by the filter coefficients. In contrast, we learn an explicit high-order MGRF structure by considering the learning process in terms of general exponential family dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The R Journal
سال: 2013
ISSN: 2073-4859
DOI: 10.32614/rj-2013-022